package com.liyunhan.LevenshteinDistance;

/**
 * @Description: 测试类
 * @Author: Liyunhan
 * @Date: 2021/11/23 21:37
 */
public class LSTest {
    public static void main(String[] args) {
        myLevenshtein test1 = new myLevenshtein(new StringBuilder("sfdxbqw"), new StringBuilder("gfdgw"));
        myLevenshtein test2 = new myLevenshtein();
        int editDistance1 = test2.theAlgorithm();
        int editDistance2 = test1.theAlgorithm();
        System.out.println("A串到B串的最小编辑距离是:" + editDistance1);
        System.out.println("A串到B串的最小编辑距离是:" + editDistance2);
    }
}
